Eecient Contact Determination between Geometric Models

نویسندگان

  • Ming C. Lin
  • Dinesh Manocha
چکیده

The problem of interference detection or contact determination between two or more objects in dynamic environments is fundamental in computer graphics, robotics and computer simulated environments. Most of the earlier work is restricted to either polyhedral models or static environments. In this paper, we present eecient algorithms for contact determination and interference detection between geometric models undergoing rigid motion. The set of models include polyhedra and surfaces described by algebraic sets or piecewise algebraic functions. The algorithms make use of temporal and spatial coherence between successive instances and their running time is a function of the motion between successive instances. The main characteristics of these algorithms are their simplicity and eeciency. They have been implemented; their performance on many applications indicates their potential for real-time simulations.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Eecient Contact Determination between Geometric Models Berkeley, C a 9 4 7 2 0

The problem of interference detection or contact determination between two or more objects in dynamic environments is fundamental in computer graphics robotics and computer simulated environments Most of the earlier work is restricted to ei ther polyhedral models or static environments In this paper we present e cient algorithms for contact determination and interference detection between geome...

متن کامل

Collision detection between geometric models: a survey

In this paper, we survey the state of the art in collision detection between general geometric models. The set of models include polygonal objects, spline or algebraic surfaces, CSG models, and deformable bodies. We present a number of techniques and systems available for contact determination. We also describe several N-body algorithms to reduce the number of pairwise intersection tests.

متن کامل

Derivation of Contact States from Geometric Models of Objects

This technical report is an extended version of paper 19] with more application results. An eecient algorithm is presented to identify the topological contacts between two contacting polytopes from their geometric models. The algorithm extends the result of the polytope distance algorithm by Gilbert et. al 8] by exploring local topological information. For convex polytopes, the algorithm has a ...

متن کامل

Fast Collision Detection between Geometric Models

We present an efficient algorithm for collision detection and contact determination between geometric models described by linear or curved boundaries and undergoing rigid motion. The set of models include surfaces described by rational spline patches or piecewise algebraic functions. In contrast to previous approaches, wefirst present a roughly constant time algorithm for collision detection be...

متن کامل

Sign Determination in Residue Number Systems

Sign determination is a fundamental problem in algebraic as well as geometric computing. It is the critical operation when using real algebraic numbers and exact geometric predicates. We propose an exact and eecient method that determines the sign of a multivariate polynomial expression with rational coeecients. Exactness is achieved by using modular computation. Although this usually requires ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007